0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n066.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:37:09 CST 2018
0.00/0.21	% done 4 iterations in 0.003s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff('thm/sets/pairwise_', axiom,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:((A * A) > $o)]:
0.00/0.21	     ('const/sets/pairwise'(A,A1,A0) <=>
0.00/0.21	      (![A2:A,A3:A]:
0.00/0.21	         (((A2 != A3) & 'const/sets/IN'(A,A3,A0) & 'const/sets/IN'(A,A2,A0)) =>
0.00/0.21	          A1(A2,A3)))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X2 : $tType, X6 : X2 > $o, X7 : (X2 * X2) > $o]:
0.00/0.21	      ('const/sets/pairwise'(X2, X7, X6)
0.00/0.21	       | 'const/sets/IN'(X2, sk_A2(X2, X7, X6), X6)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/pairwise_])).
0.00/0.21	tff('thm/sets/NOT_IN_EMPTY_', axiom,
0.00/0.21	  (![A:$tType,A0:A]: (~'const/sets/IN'(A,A0,'const/sets/EMPTY'(A))))).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0]:
0.00/0.21	      ~ 'const/sets/IN'(X0, X1, 'const/sets/EMPTY'(X0)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/NOT_IN_EMPTY_])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X0 : $tType, X1 : (X0 * X0) > $o]:
0.00/0.21	      (~ $true | 'const/sets/pairwise'(X0, X1, 'const/sets/EMPTY'(X0))),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0 : $tType, X1 : (X0 * X0) > $o]:
0.00/0.21	      'const/sets/pairwise'(X0, X1, 'const/sets/EMPTY'(X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff('thm/sets/PAIRWISE_EMPTY_', conjecture,
0.00/0.21	  (![A:$tType,A0:((A * A) > $o)]:
0.00/0.21	     ('const/sets/pairwise'(A,A0,'const/sets/EMPTY'(A)) <=> $true))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![A:$tType,A0:((A * A) > $o)]:
0.00/0.21	       ('const/sets/pairwise'(A,A0,'const/sets/EMPTY'(A)) <=> $true)))).
0.00/0.21	tff('4', plain,
0.00/0.21	    ~ 'const/sets/pairwise'(sk_A, sk_A0, 'const/sets/EMPTY'(sk_A)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('5', plain, ~ $true, inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain, $false, inference('simplify', [status(thm)], ['5'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
